Analysis of On-Line Algorithms for Due Date Quotation

نویسنده

  • Philip Kaminsky
چکیده

We present a novel model for due date quotation. Jobs arrive at a single server over time. Upon arrival, the processing time of each job is known, and due dates must be quoted for each job. The jobs must be sequenced on the server so that all jobs complete processing at or before their due dates, and the sum of quoted due dates is minimized. We develop several variations of an on-line heuristic for this problem, develop asymptotic probabilistic analytical bounds on the performance of this algorithm, and then perform extensive computational tests.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CAREER: Scheduling of Large-Scale Systems: Probabilistic Analysis and Practical Algorithms for Due Date Quotation

We present a novel single facility due-date quotation model and algorithm, and characterize the effectiveness of this algorithm employing the tools of probabilistic analysis. This model is intended to be a building block for the models that we will use to analyze due date quotation in make-to-order supply chains, and we present a summary of these models.

متن کامل

Simultaneous Due Date Assignment and Lot Sizing with Uncertain Flow Times

Due date assignment for customer orders has been studied in various productionenvironments using different modeling approaches. In this paper the researchers consider aproduction system in which the orders of several customers are produced in a single batch because ofthe economy of scale. If a batch is completed before receiving customer orders, inventory carryingcost is incurred but if it is c...

متن کامل

Inventory Positioning, Scheduling and Due-Date Quotation in Supply Chains

We consider supply chain networks composed of several centrally managed production facilities as well as external suppliers. We design effective heuristics for inventory positioning, order sequencing, and short and reliable due date quotation for this supply chain. We perform extensive computational testing to assess the effectiveness of our algorithms, and we explore the impact of supply chain...

متن کامل

Inventory positioning, scheduling and lead-time quotation in supply chains

We consider supply chain networks composed of several centrally managed production facilities as well as external suppliers. We design effective heuristics for inventory positioning, order sequencing, and short and reliable due-date quotation for this supply chain. We perform extensive computational testing to assess the effectiveness of our algorithms, and we explore the impact of supply chain...

متن کامل

On-Line Algorithms for Due Date Quotation with Lateness Penalties

We present a novel model for due date quotation. Jobs arrive at a single server or m-machine flow shop over time. Upon arrival, the processing times on each machine of the job are known, and due dates must be quoted for each job. The jobs are sequenced on the machines without preemption. Associated with each job, there are three measures of disadvantages to the inventory cost and the service le...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001